Search results for "Random access"
showing 10 items of 30 documents
Preamble Reservation Based Access for Grouped mMTC Devices with URLLC Requirements
2019
Author's accepted manuscript (postprint). © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Available from 16/07/2021. Ultra-reliable low latency communication (URLLC) and massive machine type communications (mMTC) are two of the three major technological pillars in 5G. For medium access in mMTC scenarios, e.g., smart cities, a major bottleneck for achieving reli…
Parallelizing Epistasis Detection in GWAS on FPGA and GPU-Accelerated Computing Systems
2015
This is a post-peer-review, pre-copyedit version of an article published in IEEE - ACM Transactions on Computational Biology and Bioinformatics. The final authenticated version is available online at: http://dx.doi.org/10.1109/TCBB.2015.2389958 [Abstract] High-throughput genotyping technologies (such as SNP-arrays) allow the rapid collection of up to a few million genetic markers of an individual. Detecting epistasis (based on 2-SNP interactions) in Genome-Wide Association Studies is an important but time consuming operation since statistical computations have to be performed for each pair of measured markers. Computational methods to detect epistasis therefore suffer from prohibitively lon…
The role of the Access Point in Wi-Fi networks with selfish nodes
2009
In Wi-Fi networks, mobile nodes compete for accessing the shared channel by means of a random access protocol called Distributed Coordination Function (DCF), which is long term fair. But recent drivers allow users to configure protocol parameters differently from their standard values in order to break the protocol fairness and obtain a larger share of the available bandwidth at the expense of other users. This motivates a game theoretical analysis of DCF. Previous studies have already modeled access to a shared wireless channel in terms of non-cooperative games among the nodes, but they have mainly considered ad hoc mode operation. In this paper we consider the role of the Access Point (AP…
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…
Impact of LTE’s Periodic Interference on Heterogeneous Wi-Fi Transmissions
2018
The problem of Wi-Fi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Rather than focusing on the problem of resource sharing between the two technologies, in this paper, we study the effects of LTE's structured transmissions on the Wi-Fi random access protocol. We show how the scheduling of periodic LTE transmissions modifies the behavior of 802.11's distributed coordination function (DCF), leading to a degradation of Wi-Fi performance, both in terms of channel utilization efficiency and in terms of channel access fairness. We also discuss the applicability and…
Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities
2016
One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such task…
Rate-Splitting Random Access Mechanism for Massive Machine Type Communications in 5G Cellular Internet-of-Things
2021
The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH) mechanism. However, existing RACH mechanisms are inefficient when dealing with such large number of devices. To address this issue, we propose the rate-splitting random access (RSRA) mechanism, which uses rate splitting and decoding in rate-splitting multiple access (RSMA) to improve RACH success rates. The proposed mechanism divides the message into common and private messages and enhances the decoding performance. We demonstrate, using extensive simulations, t…
MAC Design for WiFi Infrastructure Networks: A Game-Theoretic Approach
2011
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that…
Soft errors in commercial off-the-shelf static random access memories
2016
International audience; This article reviews state-of-the-art techniques for the evaluation of the effect of radiation on static random access memory (SRAM). We detailed irradiation test techniques and results from irradiation experiments with several types of particles. Two commercial SRAMs, in 90 and 65 nm technology nodes, were considered as case studies. Besides the basic static and dynamic test modes, advanced stimuli for the irradiation tests were introduced, as well as statistical post-processing techniques allowing for deeper analysis of the correlations between bit-flip cross-sections and design/architectural characteristics of the memory device. Further insight is provided on the …
Heavy-Ion Radiation Impact on a 4Mb FRAM under Different Test Conditions
2015
The impact of heavy-ions on commercial Ferroelectric Memories (FRAMs) is analyzed. The influence of different test modes (static and dynamic) on this memory is investigated. Static test results show that the memory is prone to temporary effects occurring in the peripheral circuitry. Dynamic tests results show a high sensitivity of this memory to heavy-ions.